Assignment 0: Describe a Parallel Application

نویسنده

  • Jianwei Xiao
چکیده

Weighted essentially non-oscillatory (WENO) schemes are effective numerical methods to compute flows having shocks and steep gradients. WENO schemes are based on the successful essentially non-oscillatory (ENO) schemes introduced in [9] and [10]. The initial WENO scheme is constructed in [6], and further research in WENO can be found in papers such as [2], [4] and [5]. Both ENO and WENO schemes use adaptive stencils in the reconstruction procedure based on the local smoothness of the numerical solution to automatically achieve high order accuracy and non-oscillatory property near discontinuities. Instead of choosing the optimal stencil candidate to pick an interpolating polynomial in the reconstruction procedure, WENO schemes use a convex combination of all candidates to achieve the essentially non-oscillatory property. The coefficient of each candidate is a nonlinear weight which depends on the local smoothness of the numerical solution based on the stencil.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

Graph Partitioning Algorithms with Applications to Scientific Computing Graph Partitioning Algorithms

Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...

متن کامل

A parallel adaptive tabu search approach

This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive parallelism was used to dynamically adjust the parallelism degree of the application with respect to the system load. Adaptive parallelism demonstrates that high-performance computing using a hundred of heterogeneous workstations combined with massively parallel machines is feasible to solve larg...

متن کامل

Assignment problem and its application in Nigerian institutions: Hungarian method approach

Assignment model is a powerful operations research techniques that can be used to solve assignment or allocation problem. This study applies the assignment model to the course allocation problem in Nigeria tertiary institution in order to maximize lecturers’ effectiveness. A well-structured questionnaire was used to obtain data from lecturers and solved with Hungarian method. The study revealed...

متن کامل

The complexity of multiple wordlength assignment

This note discusses the multiple wordlength assignment problem for the design of custom digital signal processing (DSP) parallel processors. It is demonstrated that this assignment problem is NP-hard. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Digital signal proceasing, Multiple wordlength, Precision, Computational complexity.

متن کامل

A GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. An effective heuristic for obtaining approximate solutions to the QAP is simulated annealing (SA). Here we describe an SA implementation for the QAP which runs on a graphics processing unit (GPU). GPUs are composed of low cost commodity graphics chips which in combination provide a powerful ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014